Power Domains and Second-Order Predicates
نویسنده
چکیده
Lower, upper, sandwich, mixed, and convex power domains are isomorphic to domains of second order predicates mapping predicates on the ground domain to logical values in a semiring. The various power domains diier in the nature of the underlying semiring logic and in logical constraints on the second order predicates.
منابع مشابه
Representing Powerdomain Elements as Monadic Second Order Predicates
This report characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a preordering of provable implication. This provides an intuitive representation which suggests a new form of powerdomain called the mixed powerdomain which expresses data in a different way from the well-known constructions from ...
متن کاملDatalog and Description Logics: Expressive Power - Preliminary Report
This paper investigates the possibility of exploiting formal analysis tools developed in the database field for the purpose of studying the expressive power of description logics augmented with rule-based query languages. We report a preliminary analysis on the expressive power of such hybrid languages. Two specific languages coupling a terminological component with Horn rules are considered. I...
متن کاملThe Interlanguage of Persian Learners of Italian: a Focus on Complex Predicates
This paper aims at investigating the acquisition of Italian complex predicates by native speakers of Persian. Complex predication is not as pervasive a phenomenon in Italian as it is in Persian. Yet Italian native speakers use complex predicates productively; spontaneous data show that Persian learners of Italian seem to be perfectly aware of Italian complex predicates and use this familiar fea...
متن کاملA Second-Order Approach to Complex Event Recognition
Complex Event Recognition (CER for short) refers to the activity of detecting patterns in streams of continuously arriving data. This field has been traditionally approached from a practical point of view, resulting in heterogeneous implementations with fundamentally different capabilities. The main reason behind this is that defining formal semantics for a CER language is not trivial: they usu...
متن کاملDecidable Theories of the Ordering of Natural Numbers with Unary Predicates
Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order logic. Building on the modeltheoretic composition method of Shelah, we give two characterizations of the decidable theories of this form, in terms of effectiveness conditions on two types of “homogeneous sets”. We discuss the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 111 شماره
صفحات -
تاریخ انتشار 1993